Node Aggregation for Enhancing PageRank

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Personalized PageRank with Node-Dependent Restart

Personalized PageRank is an algorithm to classify the improtance of web pages on a user-dependent basis. We introduce two generalizations of Personalized PageRank with nodedependent restart. The first generalization is based on the proportion of visits to nodes before the restart, whereas the second generalization is based on the probability of visited node just before the restart. In the origi...

متن کامل

Personalized PageRank to a Target Node

Personalalized PageRank uses random walks to determine the importance or authority of nodes in a graph from the point of view of a given source node. Much past work has considered how to compute personalized PageRank from a given source node to other nodes. In this work we consider the problem of computing personalized PageRanks to a given target node from all source nodes. This problem can be ...

متن کامل

Enhancing Information Through Aggregation

Many information sources, including standard accounting reports, employ aggregation. Although aggregation is commonly associated with loss of information, this paper shows that it can sometimes enhance information by deterring information cascades. Aggregated information increases the uncertainty faced by interested observers. This makes observers more willing to abide by their own views and ch...

متن کامل

Node Aggregation in Vehicle Routing

We describe a special variant of the Vehicle Routing Problem (VRP), where there are many customers per road segment. A metaheuristic tabu search algorithm for the VRP is given, and aggregation of customers is used to better the performance, with respect to both time and solution quality. The methods are tested on test instances from the literature as well as a portfolio of new test instances es...

متن کامل

PageRank Revisited: On the Relationship between Node Degrees and Node Significances in Different Applications

Random-walk based techniques, such as PageRank, encode the structure of the graph in the form of a transition matrix of a stochastic process from which significances of the graph nodes can be inferred. Recommendation systems leverage such node significance measures to rank the objects in the database. Context-aware recommendation techniques complement the data graph with additional data that pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2017

ISSN: 2169-3536

DOI: 10.1109/access.2017.2750700